SOME PROPERTIES OF {k}-PACKING FUNCTION PROBLEM IN GRAPHS
نویسندگان
چکیده
The recently introduced {k}-packing function problem is considered in this paper. Relationship between cases when k = 1, ≥ 2 and linear programming relaxation are with sufficient conditions for optimality. For arbitrary simple connected graph
منابع مشابه
Some properties of k-Delaunay and k-Gabriel graphs
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the following combinatorial and geometric properties of these graphs: spanning ratio, diameter, connectivity, chromatic number, and minimum number of layers necessary to partition the edges of the graphs so that no two edges of...
متن کاملPacking Graphs: The packing problem solved
Abstract For every fixed graph H, we determine the H-packing number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, P (H, Kn) = b 2h b n − 1 d cc, unless n = 1 mod d and n(n − 1)/d = b mod (2h/d) where 1 ≤ b ≤ d, in which case P (H, Kn) = b 2h b n ...
متن کاملsome properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولinterpersonal function of language in subtitling
translation as a comunicative process is always said to be associated with various aspects of meaning loss or gain. subtitling as a mode of translating, due to special discoursal and textual conditions imposed upon it, is believed to be an obvious case of this loss or gain. presenting the spoken sound track of a film in writing and synchronizing the perception of this text by the viewers with...
15 صفحه اولH-packing of k-chromatic graphs
For graphs H and G, let pH(G) denote the maximum number of edges covered by a set of edge-disjoint copies of H in G. We prove that if H is k-chromatic, then pH(G) ≥ pKk(G) − o(|V (G)|). The error term cannot be improved much, as for any δ > 0 there are graphs H with χ(H) = k such that for all n sufficiently large, there are graphs G with n vertices for which pH(G) ≤ pKk(G)−n. We present several...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Reports
سال: 2023
ISSN: ['1582-3067']
DOI: https://doi.org/10.59277/mrar.2023.25.75.2.263